A Note on the Uniform Filling Property and Strong Irreducibility

نویسنده

  • STEVE KASS
چکیده

Various separation properties of shift spaces have been defined in the literature. In [BPS], several were put into a chain of strict implications, leaving one open question: Is the uniform filling property (UFP) a strictly weaker condition than strong irreducibility (SI)? We given an example to show that it is, and we show that UFP and SI are equivalent for two-dimensional square filling shifts of finite type. 1. Background Definitions Let A = {1, . . . , n} be a finite alphabet. For D ⊆ Z2, y ∈ AD, v⃗ ∈ D and S ⊆ D, we will denote the symbol appearing in y at v⃗ as yv⃗ and the configuration of symbols appearing in y in the locations in S as yS. The two-dimensional, full n-shift is the set AZ2 together with the Z2-action defined by σv⃗(x)w⃗ = xv⃗+w⃗ for any x ∈ AZ2 and any v⃗, w⃗ ∈ Z2. A closed shift-invariant subset X of AZ2 together with the restriction of the Z2-action to X is called a Z2-shift space and is denoted by (X,Z2). Special notation for several particular subsets of Z2 will be helpful. Let Bm1,m2 = {(a1, a2) ∈ Z ∶ 0 ≤ ai ≤mi} be a rectangular block in the first quadrant. Similarly, denote the square block of side length 2m + 1 centered at the origin as Bm = {(a1, a2) ∈ Z ∶ ∣a1∣, ∣a2∣ ≤m}. Let Fr,k = Br−1,r−1/(Br−2k−1,r−2k−1 + (k, k)). Intuitively Fr,k is a square annulus with side length r and thickness k and with lower left corner at the origin. Recall that the maximum metric δ∞ on Z2 is given by δ∞(v⃗, w⃗) = max{∣vi −wi∣ ∶ 1 ≤ i ≤ 2} for v⃗, w⃗ ∈ Z2, and δ∞(S,T ) = min{δ∞(v⃗, w⃗) ∶ v⃗ ∈ S, w⃗ ∈ T} for non-empty subsets S,T ⊆ Z2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane

In this paper, we distinguish two levels for the plane-filling property. We consider a simple and a strong one. In this paper, we give the construction which proves that the simple plane-filling property also holds for the hyperbolic plane. The plane-filling property was established for the Euclidean plane by J. Kari, see [2], in the strong version.

متن کامل

Pollutants Emissions of Filling Stations and Their Impact on the Air Quality (RESEARCH NOTE)

This study investigated pollutants emissions from filling stations and their impact on the air quality. Gas monitors were employed to identify the different pollutants present in the ambient air of the study areas. The results showed that the most prominent pollutants present in the ambient air are the volatile organic compounds followed by methane, then carbon monoxide. Measurements were taken...

متن کامل

A Theorem À La Fatou for the Square Root of Poisson Kernel in Δ-hyperbolic Spaces and Decay of Matrix Coefficients of Boundary Representations

In this note, we prove a theorem à la Fatou for the square root of Poisson Kernel in the context of quasi-convex cocompact discrete groups of isometries of δ-hyperbolic spaces. As a corollary we show that some matrix coefficients of boundary representations cannot satisfy the weak inequality of Harish-Chandra. Nevertheless, such matrix coefficients satisfy an inequality which can be viewed as a...

متن کامل

Emergentism, Irreducibility, and Downward Causation

Several theories of emergence will be distinguished. In particular, these are synchronic, diachronic, and weak versions of emergence. While the weaker theories are compatible with property reductionism, synchronic emergentism and strong versions of diachronic emergentism are not. Synchronic emergentism is of particular interest for the discussion of downward causation. For such a theory, a syst...

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010